A class of linear partition error control codes in γ-metric
نویسنده
چکیده
Linear partition error control codes in the γ-metric is a natural generalization of error control codes endowed with the Rosenbloom-Tsfasman(RT) metric [4] to block coding and has applications in different area of combinatorial/discrete mathematics, e.g. in the theory of uniform distribution, experimental designs, cryptography etc. In this paper, we formulate the concept of linear partition codes in the γ-metric and derive results for the random block error detection and random bock error correction capabilities of these codes.
منابع مشابه
P - bursts in lpγ - spaces
In [3], the author introduced linear partition γ-codes (or lpγ-codes) as a natural generalization of error control codes endowed with the Rosenbloom-Tsfasman(RT) metric [8] to block coding and obtained various lower and upper bounds for the detection and correction of random block errors. However, a practical situation is when block errors are not randomly scattered but are confined to consecut...
متن کاملOn a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes
In this paper we try to shed a new insight on Verifiable Secret Sharing Schemes (VSS). We first define a new “metric” (with slightly different properties than the standard Hamming metric). Using this metric we define a very particular class of codes that we call error-set correcting codes, based on a set of forbidden distances which is a monotone decreasing set. Next we redefine the packing pro...
متن کاملDynamical distance as a semi-metric on nuclear conguration space
In this paper, we introduce the concept of dynamical distance on a nuclear conguration space. We partition the nuclear conguration space into disjoint classes. This classification coincides with the classical partitioning of molecular systems via the concept of conjugacy of dynamical systems. It gives a quantitative criterion to distinguish dierent molecular structures.
متن کاملSubspaces of GF(q)^w and Convolutional Codes
In this paper we demonstrate that among all subspaces of GF(q) ! convolutional codes are best suited for error control purposes. To this end we regard several deening properties of convolutional codes and study the classes of subspaces deened by each of those properties alone. It turns out that these superclasses of the class of convolutional codes either achieve no better distance to rate rati...
متن کاملDecoding of Block and Convolutional Codes in Rank Metric DISSERTATION
Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013